Protection of graphs with emphasis on Cartesian product graphs
نویسندگان
چکیده
منابع مشابه
Secret Sharing Based On Cartesian product Of Graphs
The purpose of this paper is to study the information ratio of perfect secret sharing of product of some special families of graphs. We seek to prove that the information ratio of prism graphs $Y_{n}$ are equal to $frac{7}{4}$ for any $ngeq 5$, and we will gave a partial answer to a question of Csirmaz cite{CL}. We will also study the information ratio of two other families $C_{m}times C_{n}$ a...
متن کاملThe reliability Wiener number of cartesian product graphs
Reliability Wiener number is a modification of the original Wiener number in which probabilities are assigned to edges yielding a natural model in which there are some (or all) bonds in the molecule that are not static. Various probabilities naturally allow modelling different types of chemical bonds because chemical bonds are of different types and it is well-known that under certain condition...
متن کاملConnectivity of Cartesian product graphs
Use vi , i , i , i to denote order, connectivity, edge-connectivity and minimum degree of a graphGi for i=1, 2, respectively. For the connectivity and the edge-connectivity of the Cartesian product graph, up to now, the best results are (G1×G2) 1+ 2 and (G1×G2) 1+ 2. This paper improves these results by proving that (G1×G2) min{ 1+ 2, 2+ 1} and (G1×G2)= min{ 1+ 2, 1v2, 2v1} ifG1 andG2 are conne...
متن کاملGeneralized Cartesian Product of Graphs
Abstract—In graph theory, different types of products of two graphs had been studied, e.g., Cartesian product, Tensor product, Strong product, etc. In this paper we generalize the concept of Cartesian product of graphs.We define 2 Cartesian product and more generally r Cartesian product of two graphs. We study these product mainly for path graphs. We also discuss connectedness of the new graph.
متن کاملOn subgraphs of Cartesian product graphs
Graphs which can be represented as nontrivial subgraphs of Cartesian product graphs are characterized. As a corollary it is shown that any bipartite, K2,3-free graph of radius 2 has such a representation. An infinite family of graphs which have no such representation and contain no proper representable subgraph is also constructed. Only a finite number of such graphs have been previously known.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Filomat
سال: 2019
ISSN: 0354-5180,2406-0933
DOI: 10.2298/fil1901319v